MDG-Based State Enumeration By Retiming And Circuit Transformation

نویسندگان

  • Otmane Aït Mohamed
  • Xiaoyu Song
  • Eduard Cerny
  • Sofiène Tahar
  • Zijian Zhou
چکیده

Multiway Decision Graphs (MDGs) have recently been proposed as an efficient representation for RTL designs. In this paper, we illustrate the MDG-based formal verification technique on the example of the Island Tunnel Controller. We investigate several techniques on how to deal with the nontermination problem of abstract state exploration, including a novel method based on retiming and circuit transformation. We provide comparative experimental results for the verification of a number of properties for the example using two well-known ROBDD-based verification tools, namely, SMV (Symbolic Model Verifier) and VIS (Verification Interacting with Synthesis), and we show the strength of the MDG approach to handling arbitrary data widths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Retiming for Initial State Computation

Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state for the retimed circuit. In this paper we propose a new efficient retiming algorithm for performance optimization. The retiming determined by the algorithm is the best with respect to initial state computation. It is th...

متن کامل

Transformation-Based Verification Using Generalized Retiming

In this paper we present the application of generalized retiming for temporal property checking. Retiming is a structural transformation that relocates registers in a circuit-based design representation without changing its actual input-output behavior. We discuss the application of retiming to minimize the number of registers with the goal of increasing the capacity of symbolic state traversal...

متن کامل

Automata | a Theory Dedicated towards Formal Circuit Synthesis

This is a technical report about a theory named Automata. Automata is an arithmetic for synchronous circuits. It provides means for representing and transforming circuit descriptions at the RT level and gate level in a mathemtical manner. Automata has been implemented in the HOL theorem proving environment. Preproven theorems are designed for performing standard synthesis steps such as state en...

متن کامل

Providing a formal linkage between MDG and HOL based on a verified MDG system

We describe a methodology which can provide a formal linkage between a symbolic state enumeration system and a theorem proving system based on a veri ed symbolic state enumeration system. The methodology has been partly realized in a simpli ed version of the MDG system (a symbolic state enumeration system) and the HOL system (a theorem proving system) which involves the following three steps. F...

متن کامل

Retiming Level-Clocked Circuits for Latch Count Minimization

Retiming is a powerful transformation that can minimize the number of memory elements in a sequential circuit under clock period constraints. Recent research has led to the development of extremely fast algorithms for retiming edge-triggered circuits. However, level-clocked circuits have the potential to operate faster and require less memory elements than edgetriggered circuits. This paper add...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Circuits, Systems, and Computers

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2004